Packet transport and load distribution in scale-free network models

نویسندگان

  • K.-I. Goh
  • B. Kahng
  • D. Kim
چکیده

In scale-free networks, the degree distribution follows a power law with the exponent . Many model networks exist which reproduce the scale-free nature of the real-world networks. In most of these models, the value of is continuously tunable, thus is not universal. We study a problem of data packet transport in scale-free networks and de/ne load at each vertex as the accumulated total number of data packets passing through that vertex when every pair of vertices send and receive a data packet along the shortest paths. We /nd that the load distribution follows a power law with an exponent for scale-free networks. Moreover, the load exponent is insensitive to the details of the networks in the range 2¡ 6 3. For the class of networks considered in this work, ≈ 2:2(1). We conjecture that the load exponent is a universal quantity to characterize and classify scale-free networks. c © 2002 Elsevier Science B.V. All rights reserved. PACS: 89.75.Hc; 05:10:− a; 89.70.+c; 89.75.Da

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal behavior of load distribution in scale-free networks.

We study a problem of data packet transport in scale-free networks whose degree distribution follows a power law with the exponent gamma. Load, or "betweenness centrality," of a vertex is the accumulated total number of data packets passing through that vertex when every pair of vertices sends and receives a data packet along the shortest path connecting the pair. It is found that the load dist...

متن کامل

A Hybrid Algorithm for Optimal Location and Sizing of Capacitors in the presence of Different Load Models in Distribution Network

In practical situations, distribution network loads are the mixtures of residential, industrial, and commercial types. This paper presents a hybrid optimization algorithm for the optimal placement of shunt capacitor banks in radial distribution networks in the presence of different voltage-dependent load models. The algorithm is based on the combination of Genetic Algorithm (GA) and Binary Part...

متن کامل

Optimal Placement of DGs in Distribution System including Different Load Models for Loss Reduction using Genetic Algorithm

Distributed generation (DG) sources are becoming more prominent in distribution systems due to the incremental demands for electrical energy. Locations and capacities of DG sources have great impacts on the system losses in a distribution network. This paper presents a study aimed for optimally determining the size and location of distributed generation units in distribution systems with differ...

متن کامل

Optimal Placement of DGs in Distribution System including Different Load Models for Loss Reduction using Genetic Algorithm

Distributed generation (DG) sources are becoming more prominent in distribution systems due to the incremental demands for electrical energy. Locations and capacities of DG sources have great impacts on the system losses in a distribution network. This paper presents a study aimed for optimally determining the size and location of distributed generation units in distribution systems with differ...

متن کامل

Internet Data Packet Transport: from Global Topology to Local Queueing Dynamics

We study structural feature and evolution of the Internet at the autonomous systems level. Extracting relevant parameters for the growth dynamics of the Internet topology, we construct a toy model for the Internet evolution, which includes the ingredients of multiplicative stochastic evolution of nodes and edges and adaptive rewiring of edges. The model reproduces successfully structural featur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002